A Simple Algorithm for Constructing Szemerédi's Regularity Partition
نویسندگان
چکیده
منابع مشابه
A Simple Algorithm for Constructing Szemere'di's Regularity Partition
We give a simple constructive version of Szemerédi’s Regularity Lemma, based on the computation of singular values of matrices. Mathematical Reviews Subject Numbers: 05C85, 68R10.
متن کاملA partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کاملUniversally Image Partition Regularity
Many of the classical results of Ramsey Theory, for example Schur’s Theorem, van der Waerden’s Theorem, Finite Sums Theorem, are naturally stated in terms of image partition regularity of matrices. Many characterizations are known of image partition regularity over N and other subsemigroups of (R,+). In this paper we introduce a new notion which we call universally image partition regular matri...
متن کاملPartition Regularity of Matrices
This is a survey of results on partition regularity of matrices, beginning with the classic results of Richard Rado on kernel partition regularity, continuing with the groundbreaking results of Walter Deuber on image partition regularity, and leading up to the present day. Included are the largely settled world of finite matrices and the mostly unknown world of infinite matrices.
متن کاملA SIMPLE ALGORITHM FOR COMPUTING TOPOLOGICAL INDICES OF DENDRIMERS
Dendritic macromolecules’ have attracted much attention as organic examples of well-defined nanostructures. These molecules are ideal model systems for studying how physical properties depend on molecular size and architecture. In this paper using a simple result, some GAP programs are prepared to compute Wiener and hyper Wiener indices of dendrimers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 1999
ISSN: 1077-8926
DOI: 10.37236/1449